Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
نویسندگان
چکیده
For any integer k, we prove the existence of a uniquely k-colourable graph of girth at least g on at most k 12(g+1) vertices whose maximal degree is at most 5k 13. From this we deduce that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G) log jGj 13 log k and maximum degree (G) 6k 13 can exist. We also study several related problems.
منابع مشابه
Uniquely circular colourable and uniquely fractional colourable graphs of large girth
Given any rational numbers r ≥ r′ > 2 and an integer g, we prove that there is a graph G of girth at least g, which is uniquely circular r-colourable and uniquely fractional r′-colourable. Moreover, the graph G has maximum degree bounded by a number which depends on r and r′ but does not depend on g.
متن کاملColouring triangle-free intersection graphs of boxes on the plane
We prove that intersection graphs of boxes on the plane with girth 6 and 8 are 3and 2-degenerate, respectively. This implies that these graphs are 4and 3-list-colourable, respectively. c © 2000 Published by Elsevier Science B.V. All rights reserved.
متن کاملUniquely D-colourable Digraphs with Large Girth
Let C and D be digraphs. A mapping f : V (D) → V (C) is a Ccolouring if for every arc uv of D, either f(u)f(v) is an arc of C or f(u) = f(v), and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely Ccolourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphis...
متن کاملThe existence of uniquely -G colourable graphs
Given graphs F and G and a nonnegative integer k, a function n : V(F) ~ {1 . . . . . k} is a G k-colouring of F if no induced copy of G is monochromatic; F is G k-chromatic if F has a G k-colouring but no G (k 1)-colouring. Further, we say F is uniquely G k-colourable if F is G k-chromatic and, up to a permutation of colours, it has only one G k-colouring. Such notions are extensions of the wel...
متن کاملUniqueness and complexity in generalised colouring
The study and recognition of graph families (or graph properties) is an essential part of combinatorics. Graph colouring is another fundamental concept of graph theory that can be looked at, in large part, as the recognition of a family of graphs that are colourable according to certain rules. In this thesis, we study additive induced-hereditary families, and some generalisations, from a colour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 7 شماره
صفحات -
تاریخ انتشار 1998